Multiple Sequence Alignment Using MATLAB
نویسنده
چکیده
Sequence alignment is an important task in bioinformatics which involves typical database search where data is in the form of DNA, RNA or protein sequence. For alignment various methods have been devised starting from pairwise alignment to multiple sequence alignment (MSA). To perform multiple sequence alignment various methods exists like progressive, iterative and concepts of dynamic programming in which we use Needleman Wunsch and Smith Waterman algorithms. This paper discusses various sequence alignment methods including their advantages and disadvantages. The alignment results of DNA sequence of chimpanzee and gorilla are shown.
منابع مشابه
An Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملA generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences
The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...
متن کاملGenome Sequence Analysis: A Survey
Problem statement: Sequence analysis problems are NP hard and need optimal solutions. Interesting problems include duplicate sequence detection, sequence matching by relevance, sequence analysis using approximate comparison in general or using tools i.e., Matlab and multi-lingual sequence analysis. The usefulness of these operations is highlighted and future expectations are described. Approach...
متن کاملGenetic Algorithm Based Probabilistic Motif Discovery in Unaligned Biological Sequences
Finding motif in biosequences is the most important primitive operation in computational biology. There are many computational requirements for a motif discovery algorithm such as computer memory space requirement and computational complexity. To overcome the complexity of motif discovery, we propose an alternative solution integrating genetic algorithm and Fuzzy Art machine learning approaches...
متن کاملA Comparative Study of Hidden Markov Models Learned by Optimization Techniques using DNA data for Multiple Sequence Alignment
Efficient approach are based on probabilistic models, such as the Hidden Markov Models (HMMs), which currently represent one of the most popular techniques for multiple sequence alignment. In order to use an HMM method for MSA, one has to perform the parameter learning that is, to find the best set of state transition and output probabilities for an HMM with a given set of output sequences. In ...
متن کامل